INNER-COVER OF NON-CONVEX SHAPES
نویسندگان
چکیده
منابع مشابه
Inner-Cover of Non-Convex Shapes
Visibility methods are often based on the existence of large convex occluders. We present an algorithm that for a given simple non-convex polygon P finds an approximate inner-cover by large convex polygons. The algorithm is based on an initial partitioning of P into a set C of disjoint convex polygons which are an exact tessellation of P . The algorithm then builds a set of large convex polygon...
متن کاملInner diagonals of convex polytopes
An inner diagonal of a polytope P is a segment that joins two vertices of P and that lies, except for its ends, in P ’s relative interior. For 1 ≤ i ≤ d, an i-diagonal of a d-polytope P is a segment [x, y] whose ends are vertices of P and whose carrier in P (i.e., the smallest face of P that contains [x, y]) is of dimension i. The number of P ’s i-diagonals is denoted by δi(P ). Thus δ1(P ) is ...
متن کاملConvex Shapes and Planar Caps
Any planar shape P can be embedded isometrically as part of a convex surface S ⊂ R such that ∂P supports the positive curvature of S. Of particular interest is the case when P is a filled polynomial Julia set and the curvature is proportional to the measure of maximal entropy. The (flat) surface Q = S \P is the associated cap. In this article, we study the cap construction when the curvature is...
متن کاملConvex Shapes and Harmonic Caps
Any planar shape P ⊂ C can be embedded isometrically as part of the boundary surface S of a convex subset of R such that ∂P supports the positive curvature of S. The complement Q = S \P is the associated cap. We study the cap construction when the curvature is harmonic measure on the boundary of (Ĉ\P,∞). Of particular interest is the case when P is a filled polynomial Julia set and the curvatur...
متن کاملLearning Shapes by Convex Composition
This work mainly focuses on a novel segmentation and partitioning scheme, based on learning the principal elements of the optimal partitioner in the image. The problem of interest is characterizing the objects present in an image as a composition of matching elements from a dictionary of prototype shapes. The composition model allows set union and difference among the selected elements, while r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Shape Modeling
سال: 2003
ISSN: 0218-6543,1793-639X
DOI: 10.1142/s0218654303000139